알고리즘 이해 zoj 3940 dp F(1, X) = X mod A1. F(i, X) = F(i - 1, X) mod Ai, 2 ≤ i ≤ N. Where A is an integer array of length N, X is a non-negative integer no greater than M. Peter wants to know the number of solutions for equation F(N, X) = Y, w... 알고리즘 이해
zoj 3940 dp F(1, X) = X mod A1. F(i, X) = F(i - 1, X) mod Ai, 2 ≤ i ≤ N. Where A is an integer array of length N, X is a non-negative integer no greater than M. Peter wants to know the number of solutions for equation F(N, X) = Y, w... 알고리즘 이해